Product Search Algorithm Based on Improved Ant Colony Optimization in a Distributed Network
نویسندگان
چکیده
The crowd intelligence-based e-commerce transaction network (CleTN) is a distributed and unstructured structure. Smart individuals, such as buyers, sellers, third-party organizations, can store information in local nodes connect share via moments. purpose of this study to design product search algorithm on the basis ant colony optimization (ACO) achieve an efficient accurate for demand node network. We introduce improved ideas maximum minimum ants set heuristic algorithms ACO. To reduce blindness, additional relevant factors are selected define calculation equation. pheromone update mechanism integrating into matching factor forwarding probability used rules among algorithm. Finally, facilitated by Java language programming PeerSim software. Experimental results show that has significant advantages over flooding method random walk terms success rate, time, matching, consumption, scalability. introduces idea improving system proposes new equation strategy. effectively.
منابع مشابه
Optimal Distributed Generation (DG) Allocation in Distribution Networks using an Improved Ant Colony Optimization (ACO) Algorithm
Abstract: The development of distributed generation (DGs) units in recent years have created challenges in the operation of power grids, especially distribution networks. One of these issues is the optimal allocation (location and capacity) of these units in distribution networks. In this thesis, a method based on the improved ant colony optimization algorithm is presented to solve the problem ...
متن کاملAnt Colony Optimization for Multi-objective Digital Convergent Product Network
Convergent product is an assembly shape concept integrating functions and sub-functions to form a final product. To conceptualize the convergent product problem, a web-based network is considered in which a collection of base functions and sub-functions configure the nodes and each arc in the network is considered to be a link between two nodes. The aim is to find an optimal tree of functionali...
متن کاملAn Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملOptimization Planning based on Improved Ant Colony Algorithm for Robot
As the ant colony algorithm has the defects in robot optimization path planning such as that low convergence cause local optimum, an improved ant colony algorithm is proposed to apply to the planning of path finding for robot. This algorithm uses the search way of exhumation ant to realize the complementation of advantages and accelerate the convergence of algorithm. The experimental result sho...
متن کاملANT COLONY SEARCH METHOD IN PRACTICAL STRUCTURAL OPTIMIZATION
This paper is concerned with application and evaluation of ant colony optimization (ACO) method to practical structural optimization problems. In particular, a size optimum design of pin-jointed truss structures is considered with ACO such that the members are chosen from ready sections for minimum weight design. The application of the algorithm is demonstrated using two design examples with pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International journal of crowd science
سال: 2022
ISSN: ['2398-7294']
DOI: https://doi.org/10.26599/ijcs.2022.9100016